منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملInfinite Paths in Locally Finite Graphs and in Their Spanning Trees
The paper concerns infinite paths (in particular, the maximum number of pairwise vertex-disjoint ones) in locally finite graphs and in spanning trees of such graphs.
متن کاملReconstructing some bipartite graphs from their spanning trees
Throughout, we shall understand a graph to be an undirected, connected graph without loops or multiple edges, and a spanning tree of a graph G to be a connected subgraph of G without circuits which includes every vertex of G. In [ 11, Sedlacek has asked which graphs are uniquely reconstructable from their spanning trees, and calls such graphs URST graphs. More precisely, we say G is a URST grap...
متن کاملSpanning Trees In Dense Graphs
1.1. Notation and definitions We will sometimes use + and Σ to denote disjoint unions of sets. V (G) and E(G) denote the vertex set and the edge set of the graph G, and we write v(G) = |V (G)| (order of G) and e(G) = |E(G)| (size of G). (A,B) or (A,B, E) denote a bipartite graph G = (V , E), where V = A+B, and E ⊂ A×B. In general, given any graph G and two disjoint subsets A,B of V (G), the pai...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky
سال: 1967
ISSN: 0528-2195
DOI: 10.21136/cpm.1967.108402